75 Lapack

نویسندگان

  • Zhaojun Bai
  • James Demmel
  • Jack Dongarra
  • Julien Langou
  • Jenny Wang
چکیده

University of Caifornia/Davis 75.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implementation for LAPACK of a Block Algorithm for Matrix 1-Norm Estimation

We describe double precision and complex*16 Fortran 77 implementations, in LAPACK style, of a block matrix 1-norm estimator of Higham and Tisseur. This estimator differs from that underlying the existing LAPACK code, xLACON, in that it iterates with a matrix with t columns, where t ≥ 1 is a parameter, rather than with a vector, and so the basic computational kernel is level 3 BLAS operations. O...

متن کامل

LAPACK3E -- A Fortran 90-enhanced version of LAPACK

LAPACK3E is a version of the public domain numerical linear algebra package LAPACK 3 enhanced with selected features of Fortran 90. The use of Fortran 90 enhances LAPACK by allowing a common source for single and double precision, more uniform specification of scaling constants, and encapsulation of some internal subroutine interfaces. Thread-safety is introduced as a new feature for LAPACK by ...

متن کامل

Algorithm xxx: an Efficient Algorithm for Solving Rank-Deficient Least Squares Problems

Existing routines, such as xGELSY or xGELSD in LAPACK, for solving rank-deficient least squares problems require O(mn) operations to solve min ‖b−Ax‖ where A is an m by n matrix. We present a modification of the LAPACK routine xGELSY that requires O(mnk) operations where k is the effective numerical rank of the matrix A. For low rank matrices the modification is an order of magnitude faster tha...

متن کامل

Choosing the optimal BLAS and LAPACK library

Most geodetic applications require the assembly and solution of linear equation systems. The BLAS (Basic Linear Algebra Subprograms) and LAPACK (Linear Algebra Package) have established itself as quasi-standard for linear algebra computational routines. The performance that can be achieved with a program making use of these routines is largely dependent on the performance of the chosen BLAS and...

متن کامل

Iterative refinement for linear systems and LAPACK

The technique of iterative refinement for improving the computed solution to a linear system was used on desk calculators and computers in the 1940s and has remained popular. In the 1990s iterative refinement is well,supported in software libraries, notably in LAPACK. Although the behaviour of iterative refinement in floating point arithmetic is reasonably well understood, the existing theory i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011